Stochastic Matching Problem

The stochastic matching problem

The quadratic stochastic Euclidean bipartite matching problem

We propose a new approach for the study of the quadratic stochastic Euclidean bipartite matching problem between two sets of N points each, N 1. The points are supposed independently randomly generated on a domain Ω ⊂ Rd with a given distribution ρ(x) on Ω. In particular, we derive a general expression for the correlation function and for the average optimal cost of the optimal matching. A prev...

The matching interdiction problem in dendrimers

The purpose of the matching interdiction problem in a weighted graph is to find two vertices such that the weight of the maximum matching in the graph without these vertices is minimized. An approximate solution for this problem has been presented. In this paper, we consider dendrimers as graphs such that the weights of edges are the bond lengths. We obtain the maximum matching in some types of...

On the 2-Stage Stochastic-Weighted Matching Problem

We study a 2-stage stochastic extension of the classical maximum weighted matching problem on graphs, proposed recently by Kong and Schaefer [2004]. The authors show the NPhardness of the problem and present a constant factor approximation algorithm. This work explores an extension of this approximation algorithm and studies its computational performance.

matching interdiction problem in dendrimers

the purpose of the matching interdiction problem in a weighted graph is to findtwo vertices such that the weight of the maximum matching in the graph withoutthese vertices is minimized. an approximate solution for this problem has beenpresented. in this paper, we consider dendrimers as graphs such that the weightsof edges are the bond lengths. we obtain the maximum matching in some types ofdend...